On smallest triangles

نویسندگان

  • Geoffrey R. Grimmett
  • Svante Janson
چکیده

Geoffrey Grimmett and Svante Janson Abstra t. Pick n points independently at random in R2 , according to a prescribed probability measure μ, and let ∆ 1 ≤ ∆ 2 ≤ . . . be the areas of the n 3 triangles thus formed, in non-decreasing order. If μ is absolutely continuous with respect to Lebesgue measure, then, under weak conditions, the set {n∆ i : i ≥ 1} converges as n → ∞ to a Poisson process with a constant intensity κ(μ). This result, and related conclusions, are proved using standard arguments of Poisson approximation, and may be extended to functionals more general than the area of a triangle. It is proved in addition that, if μ is the uniform probability measure on the region S, then κ(μ) ≤ 2/|S|, where |S| denotes the area of S. Equality holds in that κ(μ) = 2/|S| if S is convex, and essentially only then. This work generalizes and extends considerably the conclusions of a recent paper of Jiang, Li, and Vitányi.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The 4-triangles longest-side partition of triangles and linear refinement algorithms

In this paper we study geometrical properties of the iterative 4triangles longest-side partition of triangles (and of a 3-triangles partition), as well as practical algorithms based on these partitions, used both directly for the triangulation refinement problem, and as a basis for point insertion strategies in Delaunay refinement algorithms. The 4-triangles partition is obtained by joining the...

متن کامل

On the Area Discrepancy of Triangulations of Squares and Trapezoids

In 1970 P. Monsky showed that a square cannot be triangulated into an odd number of triangles of equal areas; further, in 1990 E. A. Kasimatis and S. K. Stein proved that the trapezoid T (α) whose vertices have the coordinates (0, 0), (0, 1), (1, 0), and (α, 1) cannot be triangulated into any number of triangles of equal areas if α > 0 is transcendental. In this paper we first establish a new a...

متن کامل

Subdivision by bisectors is dense in the space of all triangles

Starting with any nondegenerate triangle we can use a well defined interior point of the triangle to subdivide it into six smaller triangles. We can repeat this process with each new triangle, and continue doing so over and over. We show that starting with any arbitrary triangle, the resulting set of triangles formed by this process contains triangles arbitrarily close (up to similarity) any gi...

متن کامل

Largest and Smallest Area Triangles on a Given Set of Imprecise Points

In this paper we study the following problem: we are given a set of imprecise points modeled as parallel line segments, and we wish to place a point on each line segment such that the resulting point set maximizes/minimizes the size of the largest/smallest area k-gon. We first study the problem for the case k = 3. We show that for a given set of parallel line segments of equal length the larges...

متن کامل

Solutions To Some Sastry Problems On Smarandache Number Related Triangles

In his recent paper[l], Sastry defines two triangles T(a,b,c) and T(a',b',c') to be Smarandache related ifS(a) = Sea'), S(b) = S(b') and S(c) = S(c'). The function S is known as the Smarandache function and is defmed in the following way. For n any integer greater than zero, the value of the Smarandache function Sen) is the smallest integer m such that n divides m!. He closes the paper by askin...

متن کامل

On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2003